Edelweiss: Automatic Storage Reclamation for Distributed Programming
نویسندگان
چکیده
Event Log Exchange (ELE) is a common programming pattern based on immutable state and messaging. ELE sidesteps traditional challenges in distributed consistency, at the expense of introducing new challenges in designing space reclamation protocols to avoid consuming unbounded storage. We introduce Edelweiss, a sublanguage of Bloom that provides an ELE programming model, yet automatically reclaims space without programmer assistance. We describe techniques to analyze Edelweiss programs and automatically generate application-specific distributed space reclamation logic. We show how Edelweiss can be used to elegantly implement a variety of communication and distributed storage protocols; the storage reclamation code generated by Edelweiss effectively garbage-collects state and often matches hand-written protocols from the literature.
منابع مشابه
Garbage Collection in Distributed Object Systems
Large-scale, distributed computer systems are less reliable than their smallscale, non-distributed counterparts. A significant proportion of the reliability problems are due to the very poor scalability of manual storage management techniques—the reclamation of unused storage in particular. The bulk of automatic garbage reclamation in both message-passing and shared memory systems, with certain...
متن کاملPartition Selection Policies in Object Database Garbage
The automatic reclamation of storage for unreferenced objects is very important in object databases. Existing language system algorithms for automatic storage reclamation have been shown to be inappropriate. In this paper , we investigate methods to improve the performance of algorithms for automatic storage reclamation of object databases. These algorithms are based on a technique called parti...
متن کاملPartition Selection Policies in Object Database Garbage CollectionJonathan
The automatic reclamation of storage for unreferenced objects is very important in object databases. Existing language system algorithms for automatic storage reclamation have been shown to be inappropriate. In this paper , we investigate methods to improve the performance of algorithms for automatic storage reclamation of object databases. These algorithms are based on a technique called parti...
متن کاملUniprocessor Garbage Collection Techniques 1 Automatic Storage Reclamation
We survey basic garbage collection algorithms, and variations such as incremental and generational collection. The basic algorithms include reference counting, mark-sweep, mark-compact, copying, and treadmill collection. Incremental techniques can keep garbage collection pause times short, by interleaving small amounts of collection work with program execution. Generational schemes improve effi...
متن کاملUniprocessor Garbage Collection Techniques
We survey basic garbage collection algorithms and variations such as incremental and gen erational collection The basic algorithms include reference counting mark sweep mark compact copy ing and treadmill collection Incremental techniques can keep garbage collection pause times short by interleaving small amounts of collection work with program execution Generational schemes improve e ciency an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- PVLDB
دوره 7 شماره
صفحات -
تاریخ انتشار 2014